SPLBoost: An Improved Robust Boosting Algorithm Based on Self-Paced Learning

نویسندگان

چکیده

It is known that Boosting can be interpreted as a gradient descent technique to minimize an underlying loss function. Specifically, the being minimized by traditional AdaBoost exponential loss, which proved very sensitive random noise/outliers. Therefore, several algorithms, e.g., LogitBoost and SavageBoost, have been proposed improve robustness of replacing with some designed robust functions. In this work, we present new way robustify AdaBoost, i.e., incorporating learning idea Self-paced Learning (SPL) into framework. design algorithm based on SPL regime, SPLBoost, easily implemented slightly modifying off-the-shelf packages. Extensive experiments theoretical characterization are also carried out illustrate merits SPLBoost.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SPLBoost: An Improved Robust Boosting Algorithm Based on Self-paced Learning

It is known that Boosting can be interpreted as a gradient descent technique to minimize an underlying loss function. Specifically, the underlying loss being minimized by the traditional AdaBoost is the exponential loss, which is proved to be very sensitive to random noise/outliers. Therefore, several Boosting algorithms, e.g., LogitBoost and SavageBoost, have been proposed to improve the robus...

متن کامل

Robust Sparse Coding via Self-Paced Learning

Sparse coding (SC) is attracting more and more attention due to its comprehensive theoretical studies and its excellent performance in many signal processing applications. However, most existing sparse coding algorithms are nonconvex and are thus prone to becoming stuck into bad local minima, especially when there are outliers and noisy data. To enhance the learning robustness, in this paper, w...

متن کامل

Self-Paced Learning: An Implicit Regularization Perspective

Self-paced learning (SPL) mimics the cognitive mechanism of humans and animals that gradually learns from easy to hard samples. One key issue in SPL is to obtain better weighting strategy that is determined by the minimizer functions. Existing methods usually pursue this by artificially designing the explicit form of regularizers. In this paper, we focus on the minimizer functions, and study a ...

متن کامل

Self-Paced Curriculum Learning

Curriculum learning (CL) or self-paced learning (SPL) represents a recently proposed learning regime inspired by the learning process of humans and animals that gradually proceeds from easy to more complex samples in training. The two methods share a similar conceptual learning paradigm, but differ in specific learning schemes. In CL, the curriculum is predetermined by prior knowledge, and rema...

متن کامل

An Improved Robust and Adaptive Watermarking Algorithm Based on DCT

This paper proposes an improved watermarking algorithm based on DCT (Discrete Cosine Transform). We carried out the algorithm as described as follows. First, we extended both rows and ranks of the watermark by using the proposed method before the embedding stage. After expansion, Sine chaotic system is employed in encrypting the watermark. In the embedding stage, an effective and adaptive embed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on cybernetics

سال: 2021

ISSN: ['2168-2275', '2168-2267']

DOI: https://doi.org/10.1109/tcyb.2019.2957101